Local Signature Quantization by Sparse Coding

نویسندگان

  • Davide Boscaini
  • Umberto Castellani
چکیده

In 3D object retrieval it is very important to define reliable shape descriptors, which compactly characterize geometric properties of the underlying surface. To this aim two main approaches are considered: global, and local ones. Global approaches are effective in describing the whole object, while local ones are more suitable to characterize small parts of the shape. Some strategies to combine these two approaches have been proposed recently but still no consolidate work is available in this field. With this paper we address this problem and propose a new method based on sparse coding techniques. A set of local shape descriptors are collected from the shape. Then a dictionary is trained as generative model. In this fashion the dictionary is used as global shape descriptor for shape retrieval purposes. Preliminary experiments are performed on a standard dataset by showing a drastic improvement of the proposed method in comparison with well known local-to-global and global approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local features are not lonely - Laplacian sparse coding for image classification

Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the visual codebook generation and feature quantization process of BoW based image representation. However, in the feature quantization process of sparse coding, some similar local features may be quantized into different visual words of the codebook due to the sensitiveness o...

متن کامل

A New Image Retrieval Algorithm Based on Sparse Coding

The Bag-of-visual-words (BOVW) model discards image spatial information, and the computing cost is expensive on spatial pyramid matching(SPM) model. Due to sparse coding approach exhibit super performance in information retrieval, hence, we propose a new sparse coding image retrieval algorithm. Using 2 l norm replace 0 l norm in SPM vector quantization. The local information was incorporated in...

متن کامل

Signature Design of Sparsely Spread CDMA Based on Superposed Constellation Distance Analysis

Sparsely spread code division multiple access (SCDMA) is a non-orthogonal superposition coding scheme that permits a base station simultaneously communicates with multiple users over a common channel. The detection performance of an SCDMA system is mainly determined by its signature matrix, which should be sparse to guarantee large Euclidean distance for the equivalent signal constellation afte...

متن کامل

Supervised learning of bag-of-features shape descriptors using sparse coding

We present a method for supervised learning of shape descriptors for shape retrieval applications. Many contentbased shape retrieval approaches follow the bag-of-features (BoF) paradigm commonly used in text and image retrieval by first computing local shape descriptors, and then representing them in a ‘geometric dictionary’ using vector quantization. A major drawback of such approaches is that...

متن کامل

Kernel Sparse Representation for Image Classification and Face Recognition

Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear similarity of features, which may reduce the feature quantization error and boost the sparse coding performance, we propose Kernel Sparse Representation(KSR). KSR is essentially the sparse coding technique in a high dime...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013